Improved formulations of the joint order batching and picker routing problem
نویسندگان
چکیده
Order picking is the process of retrieving ordered products from storage locations in warehouses. In picker-to-parts order systems, two or more customer orders may be grouped and assigned to a single picker. Then routing decisions regarding visiting sequence items during tour must made. Won Olafsson (2005) found that solving integrated problem batching enables warehouse managers organize operations efficiently compared with problems separately sequentially. We therefore investigate mathematical programming formulation this problem.We present several improved formulations based on findings Valle, Beasley, Salles da Cunha (2017), can significantly improve computational results. More specifically, we reconstruct connectivity constraints generate new cutting planes our branch-and-cut framework. also discuss some properties by studying structure graphical representation warehouse, types additional constraints. consider no-reversal case problem. efficient building different auxiliary graphs. Finally, results for publicly available test single-block multiple-block configurations.
منابع مشابه
Optimally solving the joint order batching and picker routing problem
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...
متن کاملJoint order batching and picker Manhattan routing problem
In picking product items in a warehouse to fulfill customer orders, a practical way is to classify similar orders as the same batch and then to plan the optimal picker routing when picking each batch of items. Different from the previous problems, this work investigates the joint order batching and picker Manhattan routing problem, which simultaneously determines the optimal order batching allo...
متن کاملA Solution Approach for the Joint Order Batching and Picker Routing Problem in a Two-Block Layout
Order Batching and Picker Routing Problems arise in warehouses when articles have to be retrieved from their storage location in order to satisfy a given demand specified by customer orders. The Order Batching Problem includes the grouping of a given set of customer orders into feasible picking orders such that the total length of all picker tours is minimized. The problem of determining the se...
متن کاملA Genetic Algorithm for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems
In this work we introduce a Genetic Algorithm (GA) for the Order Batching Problem considering traversal and return routing policies. The proposed GA has been tested on randomly generated instances and compared with the wellknown savings algorithm. According to our extensive computational experiments we can say that the proposed GA yields promising solutions in acceptable computation times.
متن کاملOrder Batching in a Bucket Brigades Order Picking System with Consideration of Picker Blocking
A bucket brigade strategy allows workloads in warehouses to be distributed with a minimal level of managerial planning and oversight. However, the variability and uncertainty of the pick locations within a particular order or batch often results in picker blocking and subsequent losses in productivity. This study formulates an order batching model for robust blocking control of dynamic bucket b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2022
ISSN: ['1366-588X', '0020-7543']
DOI: https://doi.org/10.1080/00207543.2022.2149872